منابع مشابه
Decision Problems for Deterministic Pushdown Automata on Infinite Words
The article surveys some decidability results for DPDAs on infinite words (ω-DPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak ω-DPDAs. Furthermore, we present some new results on the parity index problem for ωDPDAs. For the specification of a parity condition, the states of the omega-DPDA are assigned priorities (nat...
متن کاملRegularity Problems for Visibly Pushdown Languages
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automaton that uses its stack only as counter. In particular, this allows to decide whether a given visibly pushdo...
متن کاملOn Boundedness Problems for Pushdown Vector Addition Systems
We study pushdown vector addition systems, which are synchronized products of pushdown automata with vector addition systems. The question of the boundedness of the reachability set for this model can be refined into two decision problems that ask if infinitely many counter values or stack configurations are reachable, respectively. Counter boundedness seems to be the more intricate problem. We...
متن کاملRegularity Problems for Weak Pushdown ω-Automata and Games
We show that the regularity and equivalence problems are decidable for deterministic weak pushdown ω-automata, giving a partial answer to a question raised by Cohen and Gold in 1978. We prove the decidability by a reduction to the corresponding problems for deterministic pushdown automata on finite words. Furthermore, we consider the problem of deciding for pushdown games whether a winning stra...
متن کاملOn the Complexity of Bisimulation Problems for Pushdown Automata
All bisimulation problems for pushdown automata are at least PSPACE-hard. In particular, we show that (1) Weak bisimilarity of pushdown automata and nite automata is PSPACE-hard, even for a small xed nite automaton, (2) Strong bisimilarity of pushdown au-tomata and nite automata is PSPACE-hard, but polynomial for every xed nite automaton, (3) Regularity ((niteness) of pushdown automata w.r.t. w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2007
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-007-0040-5